Covering a Point Set by Two Disjoint Rectangles
نویسندگان
چکیده
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel but the other rectangle is allowed to be in arbitrary orientation. For both of the problems, we present O(n logn)-time algorithms using O(n) space.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملCuttings for Disks and Axis-Aligned Rectangles in Three-Space
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1r -cutting is a covering of the space with simplices such that the interior of each simplex intersects at most n/r objects. For n pairwise disjoint disks in R and a parameter r ∈ N, we construct a 1r -cutting of size O(r). For n axis-a...
متن کاملCovering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For ...
متن کاملIlluminating Rectangles and Triangles in the Plane
A set S of light sources, idealized as points, illuminates a collection F of convex sets if each point in the boundary of the sets of F is visible from at least one point in S. For any n disjoint plane isothetic rectangles, Î(4n+4)/3 ̊ lights are sufficient to illuminate their boundaries. If in addition, the rectangles have equal width, then n+1 lights always suffice and n-1 are occasionally nec...
متن کاملThe Maximum Disjoint Set of Boundary Rectangles
We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are attached to the boundary of a bounding box. We present an algorithm for solving the problem in O(n) time, improving upon the best previous O(n)-time solution available for the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2008